Primary Non-QE Graphs on Six Vertices
نویسندگان
چکیده
A connected graph is called of non-QE class if it does not admit a quadratic embedding in Euclidean space. primary contain as an isometrically embedded proper subgraph. The graphs on six vertices are completely classified into the classes QE graphs, and graphs.
منابع مشابه
COSPECTRALITY MEASURES OF GRAPHS WITH AT MOST SIX VERTICES
Cospectrality of two graphs measures the differences between the ordered spectrum of these graphs in various ways. Actually, the origin of this concept came back to Richard Brualdi's problems that are proposed in cite{braldi}: Let $G_n$ and $G'_n$ be two nonisomorphic simple graphs on $n$ vertices with spectra$$lambda_1 geq lambda_2 geq cdots geq lambda_n ;;;text{and};;; lambda'_1 geq lambda'_2...
متن کاملEla Inertia Sets for Graphs on Six or Fewer Vertices
Let G be an undirected graph on n vertices and let S(G) be the set of all real symmetric n×n matrices whose nonzero off-diagonal entries occur in exactly the positions corresponding to the edges of G. The inverse inertia problem for G asks which inertias can be attained by a matrix in S(G), a question which was previously answered when G is a tree. In this paper, a number of new techniques are ...
متن کاملcospectrality measures of graphs with at most six vertices
cospectrality of two graphs measures the differences between the ordered spectrum of these graphs in various ways. actually,the origin of this concept came back to richard brualdi's problems that are proposed in cite{braldi}:let $g_n$ and $g'_n$ be two nonisomorphic simple graphs on $n$ vertices with spectra$$lambda_1 geq lambda_2 geq cdots geq lambda_n ;;;text{and};;; lambda'_1 geq lambda'_2 g...
متن کاملDesigns for graphs with six vertices and nine edges
The design spectrum has been determined for eleven of the 21 graphs with six vertices and nine edges. In this paper we completely solve the design spectrum problem for the remaining ten graphs.
متن کاملCospectral Graphs on 12 Vertices
We found the characteristic polynomials for all graphs on 12 vertices, and report statistics related to the number of cospectral graphs.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Interdisciplinary Information Sciences
سال: 2023
ISSN: ['1340-9050', '1347-6157']
DOI: https://doi.org/10.4036/iis.2023.r.01